From dynamic programming to fast transforms
نویسندگان
چکیده
منابع مشابه
Developing Fast Fourier Transforms using the EXTENT Parallel Programming Environmentz
EXTENT stands for an EXpert system for TENsor product formula Translation. In this paper, we describe the development of programs for fast Fourier transforms (FFT) for vector multiprocessors and distributed-memory machines using the EXTENT system for formula translation. Several forms of the FFT have been presented in the literature. Each form has diierent characteristics and is best suited for...
متن کاملDynamic Programming and Fast Matrix Multiplication
We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on reducing much of the computation involved to matrix multiplication. We exemplify our approach on problems like Vertex Cover, Dominating Set and Longest Path. Our approach works faster than the usual dynamic programming solution fo...
متن کاملFast Modular Transforms
It is shown that if division and multiplication in a Euclidean domain can be performed in O(N log ~ N) steps, then the residues of an N precision element in the domain can be computed in O(N log a+l N) steps. A special case of this result is that the residues of an N precision integer can be computed in O(N logS N log log N) total operations. Using a polynomial division algorithm due to Strasse...
متن کاملFast linear canonical transforms.
The linear canonical transform provides a mathematical model of paraxial propagation though quadratic phase systems. We review the literature on numerical approximation of this transform, including discretization, sampling, and fast algorithms, and identify key results. We then propose a frequency-division fast linear canonical transform algorithm comparable to the Sande-Tukey fast Fourier tran...
متن کاملFast Fourier Transforms
29 O(b log(b)) operations (using standard multiplication). As there are O(b= log(b)) primes in total, the running time of this stage of the algorithm is O(b 2 L), even using the \grammar school" method of integer multiplication. At this stage of the algorithm we have obtained a vector of length L whose entries are integral linear combinations of powers of with coeecients bounded by M in absolut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1986
ISSN: 0022-247X
DOI: 10.1016/0022-247x(86)90145-9